Superresolution Using Preconditioned Conjugate Gradient Method
نویسندگان
چکیده
In this paper we present a fast iterative image superresolution algorithm using preconditioned conjugate gradient method. To avoid explicitly computing the tolerance in the inverse filter based preconditioner scheme, a new Wiener filter based preconditioner for the conjugate gradient method is proposed to speed up the convergence. The circulant-block structure of the preconditioner allows efficient implementation using Fast Fourier Transform. Effectiveness of the preconditioner is demonstrated by superresolution results for simulated image sequences.
منابع مشابه
Convergence and Instability in PCG
Bordered almost block diagonal systems arise from discretizing a linearized rst-order system of n ordinary diierential equations in a two-point boundary value problem with non-separated boundary conditions. The discretization may use spline collocation, nite diierences, or multiple shooting. After internal condensation, if necessary, the bordered almost block diagonal system reduces to a standa...
متن کاملAn K - Step Preconditioned Conjugate Gradient Hethod
Tbis paper describes a preconditioned conjugate gradient method tbat can be effectively implemented on both vector machines and parallel arrays to solve sparse symmetric and positive definite systema of linear equations. The implementation on the CYBER 203/205 and on tbe Finite Element Machine is discuased and result a obtained using the method on these machines are siven.
متن کاملPreconditioning for Temporal Video Superresolution
Temporal superresolution produces a video sequence of high temporal resolution (HTR), i.e. frame rate, from a set of video sequences of low temporal resolution (LTR). A method for preconditioning large systems of linear equations arising in temporal video superresolution problems is presented. We show that circulant block preconditioners can accelerate the convergence of iterative techniques su...
متن کاملSolving large systems arising from fractional models by preconditioned methods
This study develops and analyzes preconditioned Krylov subspace methods to solve linear systems arising from discretization of the time-independent space-fractional models. First, we apply shifted Grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. Then, we employee two preconditioned iterative methods, namely, the preconditioned gen...
متن کاملMicrosoft Word - 10001.rtf
This paper reports work done to improve the modeling of complex processes when only small experimental data sets are available. Neural networks are used to capture the nonlinear underlying phenomena contained in the data set and to partly eliminate the burden of having to specify completely the structure of the model. Two different types of neural networks were used for the application of Pulpi...
متن کامل